Constraint Generation for Two-Stage Robust Network Flow Problems
نویسندگان
چکیده
منابع مشابه
Solving Two-stage Robust Optimization Problems by A Constraint-and-Column Generation Method
We present a constraint-and-column generation algorithm to solve two-stage robust optimization problems. Compared with existing Benders style cutting plane methods, it is a general procedure with a unified approach to deal with optimality and feasibility. A computational study on a two-stage robust location-transportation problem shows that it performs an order of magnitude faster. Also, it rev...
متن کاملSolving two-stage robust optimization problems using a column-and-constraint generation method
In this paper, we present a column-and-constraint generation algorithm to solve twostage robust optimization problems. Compared with existing Benders-style cutting plane methods, the column-and-constraint generation algorithm is a general procedure with a unified approach to deal with optimality and feasibility. A computational study on a twostage robust location-transportation problem shows th...
متن کاملA Two-Stage Chance-Constraint Stochastic Programming Model for Electricity Supply Chain Network Design
Development of every society is incumbent upon energy sector’s technological and economic effectiveness. The electricity industry is a growing and needs to have a better performance to effectively cover the demand. The industry requires a balance between cost and efficiency through careful design and planning. In this paper, a two-stage stochastic programming model is presented for the design o...
متن کاملTwo-Stage Robust Network Flow and Design Under Demand Uncertainty
We describe a two-stage robust optimization approach for solving network flow and design problems with uncertain demand. In two-stage network optimization, one defers a subset of the flow decisions until after the realization of the uncertain demand. Availability of such a recourse action allows one to come up with less conservative solutions compared to singlestage optimization. However, this ...
متن کاملNetwork Flow Problems in Constraint Programming
We introduce a new global constraint for modeling and solving network flow problems in constraint programming. We describe the declarative and operational semantics of the flow constraint and illustrate its use through a number of applications.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INFORMS Journal on Optimization
سال: 2019
ISSN: 2575-1484,2575-1492
DOI: 10.1287/ijoo.2018.0003